A classi cation of plane and planar 2 - trees 1
نویسندگان
چکیده
We present new functional equations for the species of plane and of planar in the sense of Harary and Palmer, 1973 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e.a classiication of their structures according to their stabilizers. Therein result explicit formulas in terms of Catalan numbers for their associated generating series, including the asymmetry index series. This work is related to the enumeration of polyene hydrocarbons of molecular formula C n H n+2 .
منابع مشابه
Generalization bounds for incremental search classi cation algorithms
This paper presents generalization bounds for a certain class of classi cation algorithms. The bounds presented take advantage of the local nature of the search that these algorithms use in order to obtain bounds that are better than those that can be obtained using VC type bounds. The results are applied to well-known classi cation algorithms such as classi cation trees and the perceptron.
متن کاملFuzzy classification trees for data analysis
Overly generalized predictions are a serious problem in concept classi!cation. In particular, the boundaries among classes are not always clearly de!ned. For example, there are usually uncertainties in diagnoses based on data from biochemical laboratory examinations. Such uncertainties make the prediction be more di4cult than noise-free data. To avoid such problems, the idea of fuzzy classi$cat...
متن کاملOrderly Spanning Trees with Applications
We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning ...
متن کاملA Hierarchical Ensemble of Decision Trees Applied to Classifying Data from a Psychological Experiment
from a psychological experiment Yannick Lallement Human-Computer Interaction Institute Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213 [email protected] Abstract Classifying by hand complex data coming from psychology experiments can be a long and di cult task, because of the quantity of data to classify and the amount of training it may require. One way to alleviate this probl...
متن کامل2 J ul 2 00 1 Orderly Spanning Trees with Applications ∗ Hsueh -
We introduce and study the orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of a plane graph H of G, and an orderly spanning tree of H. We also...
متن کامل